Exploiting path diversity in the link layer in wireless ad hoc networks
نویسندگان
چکیده
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملExploiting Mobility in Large Scale Ad Hoc Wireless Networks
Mobility is generally viewed as a major impediment in the control and management of large scale wireless networks. However, recently researchers have looked at mobility in a different way, trying to take advantage of it instead of protecting from it. In the literature, mobility is generally modeled as independent random moves by each node. However, in reality, mobile nodes tend to show some deg...
متن کاملLink Reliable Joint Path and Spectrum Diversity in Cognitive Radio Ad-Hoc Networks
P. Periyasamy Department of Computer Science and Applications Sree Saraswathi Thyagaraja College Pollachi 642 107, Tamil Nadu, India Email: [email protected] Dr. E. Karthikeyan Department of Computer Science Government Arts College Udumalpet 642 126, Tamil Nadu, India Email: [email protected] ----------------------------------------------------------------------ABSTRACT-------------------------...
متن کاملLink Stability and Route Lifetime in Ad-hoc Wireless Networks
Many routing algorithms, proposed for ad-hoc wireless networks, are based on source routing scheme. When a route is broken in source routing, route recovery and maintenance procedures are executed. However, these procedures consume many resources. To minimize route breaking, it’s important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dens...
متن کاملLoad Balanced Link Reversal Routing in Wireless Ad Hoc Networks
The link reversal routing (LRR) algorithm maintains loop free routes in mobile ad hoc wireless networks while incurring low overhead. In this paper we explore the problem of balancing the load of forwarding traffic in LRR algorithm. We make some important observations regarding the situations that lead to load unbalance in the LRR algorithm and formally define the load balancing problem. Based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ad Hoc Networks
سال: 2008
ISSN: 1570-8705
DOI: 10.1016/j.adhoc.2007.07.002